VisOpt: a visual interactive optimization tool for P-median problems
نویسندگان
چکیده
1 School of Management, The University of Texas at Dallas, Richardson, Texas. email: [email protected] 2 Department of Management, Oklahoma State University, Stillwater Ok, 74078 email: [email protected] 3 Department of Accounting and MIS, The Ohio State University, Columbus, Ohio 43210 email: [email protected] Abstract. In this paper we describe a visual interactive decision support tool ‘VisOpt’ which is designed to solve P-median problems with capacity constraints. Various design features incorporated in VisOpt are also presented and analyzed. We also present a demonstration of the use of VisOpt by a number of human subjects for various problem instances. The quality of solutions obtained by subjects using VisOpt is compared with that obtained from a standard stand alone heuristic. The visual interactive tool provides encouraging results in this specific problem context.
منابع مشابه
PERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کاملVisopt ShopFloor: Going Beyond Traditional Scheduling
Visopt ShopFloor is a generic scheduling system for solving complex scheduling problems. It differentiates from traditional schedulers by offering some planning capabilities. In particular, the activities to achieve the goal are planned dynamically during scheduling. In the paper, we give a motivation for the integration of planning and scheduling and we describe how such integration is realise...
متن کاملInteractive multiple objective programming in optimization of the fully fuzzy quadratic programming problems
In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered. To optimize th...
متن کاملAn Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملVisopt ShopFloor
Visopt ShopFloor is a complete system for solving real-life scheduling problems in complex industries. In particular, the system is intended to problem areas where traditional scheduling methods failed. In the paper we describe the heart of the Visopt system, a generic scheduling engine. This engine goes beyond traditional scheduling by offering some planning capabilities. We achieved this inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Decision Support Systems
دوره 26 شماره
صفحات -
تاریخ انتشار 1999